Using Remote Memory to Avoid Disk Thrashing: A Simulation Study
نویسنده
چکیده
The increasing use of high-bandwidth and low-latency networks make possible the use of remote (network) memory as an alternative to disk means of storing an application’s data, because remote-to-local memory transfers over a modern interconnection network are faster than traditional disk-to-memory transfers. In this paper we explore the possibility of using the remote memory as (i) a (fasterthan-disk) backing store, (ii) an extension of main memory accessed using single (remote) memory references, and (iii) as a combination of both. We use execution driven simulation to investigate the performance impact the use of remote memory has on several real programs. We conclude that even for today’s low throughput networks, using remote memory as a place for storing (some) of an application’s data may result in significant performance improvements, which will continue to get higher, as the disparity between disk transfer rates and network transfer rates continues to increase.
منابع مشابه
A Transparent Remote Paging Model for Virtual Machines
In virtual machine systems, with the increase in the number of VMs and the demands of the applications, the main memory is becoming a bottleneck for the application performance. To improve paging performance and alleviating thrashing behavior for memory-intensive or I/O-intensive virtual machine workloads, we proposed hypervisor based remote paging, which allows a virtual machine to transparent...
متن کاملDynamic Memory Allocation for Large Query Execution
The execution time of a large query depends mainly on the memory utilization which should avoid disk accesses for intermediate results. Poor memory management can hurt performance and even lead to system thrashing because of paging. However, memory management optimization is hard to incorporate in a query optimizer because of cost estimate errors. In this paper, we address the problem of effici...
متن کاملMathematical Model for Distributed Heap Memory Load Balancing
In this paper, we will introduce a new method to achieve the fair distribution of data among distributed memories in a distributed system. Some processes consume larger amount of heap spaces [1] in its local memory than the others. So, those processes may use the virtual memory and may cause the thrashing problem [2].At the same time, the rest of heap memories in that distributed system remain ...
متن کاملSwap Fairness for Thrashing Mitigation
The swap mechanism allows an operating system to work with more memory than available RAM space, by temporarily flushing some data to disk. However, the system sometimes ends up spending more time swapping data in and out of disk than performing actual computation. This state is called thrashing. Classical strategies against thrashing rely on reducing system load, so as to decrease memory press...
متن کاملBlueprint for a Hard Real-time File System
We examine the problem of scheduling disk requests in a personal hard real-time read/write file system. For arbitrary aperiodic requests, we model the problem of moving the disk arm as a travelling salesperson problem on a one dimensional line, where travel time is proportional to the distance and the time spent at each city is zero. We propose an optimal dynamic-programming algorithm to solve ...
متن کامل